Characterizing affine $${\mathcal {C}}$$-semigroups

نویسندگان

چکیده

Abstract Let $${\mathcal {C}} \subset {\mathbb {N}}^p$$ C ⊂ N p be a finitely generated integer cone and $$S\subset {\mathcal {C}}$$ S an affine semigroup such that the real cones by S are equal. The is called -semigroup if {C}}\setminus S$$ \ finite set. In this paper, we characterize -semigroups from their minimal generating sets, give algorithm to check compute its set of gaps. We also study embedding dimension obtaining lower bound for it, introduce some families whose reaches our bound. last section, present method obtain decomposition into irreducible -semigroups.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on Affine Semigroups

A semigroup is a nonvoid Hausdorff space together with a continuous associative multiplication, denoted by juxtaposition. In what follows S will denote one such and it will be assumed that S is compact. I t thus entails no loss of generality to suppose that S is contained in a locally convex linear topological space 9C, but no particular imbedding is assumed. For general notions about semigroup...

متن کامل

Semigroups Characterizing Hypergraphs

Various semigroups can be associated with graphs and hypergraphs. Mainly, these have been endomorphism monoids. However, other types of semigroups (e.g. restrictive semigroups of partial extensive transformations of graphs) have been considered. A good survey of semigroups connected with graphs is given in [5]. In this paper, a new type of semigroups connected with hypergraphs is considered. We...

متن کامل

$\mathcal C$-graph automatic groups

We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov by replacing the regular languages in their definition with more powerful language classes. For a fixed language class C, we call the resulting groups C-graph automatic. We prove that the class of C-graph automatic groups is closed under change of generating set, direct and free product fo...

متن کامل

Characterizing Ordered Bi-Ideals in Ordered Γ-Semigroups

The notion of a &Gamma-semigroup was introduced by Sen [8] in 1981. We can see that any semigroup can be considered as a &Gamma-semigroup. The aim of this article is to study the concept of (0-)minimal and max- imal ordered bi-ideals in ordered &Gamma-semigroups, and give some charac- terizations of (0-)minimal and maximal ordered bi-ideals in ordered &Gamma- semigroups analogous to the charact...

متن کامل

Factorization Invariants in half-Factorial Affine Semigroups

Let NA be the monoid generated byA = {a1, . . . ,an} ⊆ Z.We introduce the homogeneous catenary degree of NA as the smallest N ∈ N with the following property: for each a ∈ NA and any two factorizations u,v of a, there exists factorizations u = w1, . . . ,wt = v of a such that, for every k, d(wk,wk+1) ≤ N, where d is the usual distance between factorizations, and the length of wk, |wk|, is less ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ricerche Di Matematica

سال: 2022

ISSN: ['1827-3491', '0035-5038']

DOI: https://doi.org/10.1007/s11587-022-00693-6